Chapter 8 Regularity , Document Generation , and Cyc

نویسندگان

  • Hafedh Mili
  • François Pachet
چکیده

We are interested in building and maintaining semantic nets in general, and hierarchical semantic nets in particular. In [Mili, 1988], we developed a model of hierarchical semantic nets that generalizes taxonomic models by replacing the concept of property inheritance by a more general behavior of properties that we called regularity [Mili & Rada, 1990a]. We are also interested in the generation of structured documents from hypertext. We argue that authors structure their descriptive documents based on personal but systematic traversals of a model of the domain of discourse [Mili & Rada, 1990b]; when that model consists of a semantic net that exhibits regularity, the traversal can be rationalized and described concisely. Within the context of our research, we acquired an electronic copy of the Cyc knowledge base [Lenat & Guha, 1990] to: 1) use the semantic net underlying Cyc to support the generation of argumentative and explanatory documents, and 2) identify regularity patterns. Interestingly, the sheer size and richness of Cyc posed challenging performance problems to its designers, who had to constrain proof and inference procedures in such a way as to make it ill-adapted to 1LARC, in French, stands for Laboratoire pour l’Acquisition et la Représentation des Connaissances. the kind of open-ended lengthy logical inferences required for generation of argumentative text. The study of regularity patterns in Cyc led us to generalize the concept of regularity, and to formulate a number of hypotheses about the semantic structure of Cyc, and of common sense knowledge in general, proving once more that regularity is a powerful tool for managing the complexity of large knowledge bases.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploiting regularity in Cyc for text generation

In order to provide hypertext with text generation facilities we combine hypertext with knowledge bases and create expertext systems. This paper studies a particular characteristics of hierarchical semantic nets called regularity, which has proved to be a very valuable tool for expertext construction and use. We show how regularity can be transposed in the context of the Cyc knowledge base to p...

متن کامل

Automatic Workflow Generation and Modification by Enterprise Ontologies and Documents

This article presents a novel method and development paradigm that proposes a general template for an enterprise information structure and allows for the automatic generation and modification of enterprise workflows. This dynamically integrated workflow development approach utilises a conceptual ontology of domain processes and tasks, enterprise charts, and enterprise entities. It also suggests...

متن کامل

Automatic Workflow Generation and Modification by Enterprise Ontologies and Documents

This article presents a novel method and development paradigm that proposes a general template for an enterprise information structure and allows for the automatic generation and modification of enterprise workflows. This dynamically integrated workflow development approach utilises a conceptual ontology of domain processes and tasks, enterprise charts, and enterprise entities. It also suggests...

متن کامل

A Study of the Commentators` View on the First Verses of the Chapter Rum

As viewed by a group of Sunni commentators according to Ibn Abbas's narration, the first verses of the chapter Rum: "Alif. Lam. Mim. The Romans have been defeated In the nearer land, and they, after their defeat will be victorious …" revealed between two war of Iran and Rome. In the first war the Iranians won and a verse carrying the message of the Romans` victory revealed They were victorious,...

متن کامل

Non-cyclic Graph of a Group

We associate a graph ΓG to a non locally cyclic group G (called the non-cyclic graph of G) as follows: take G\Cyc(G) as vertex set, where Cyc(G) = {x ∈ G | 〈x, y〉 is cyclic for all y ∈ G}, and join two vertices if they do not generate a cyclic subgroup. We study the properties of this graph and we establish some graph theoretical properties (such as regularity) of this graph in terms of the gro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008